On Graphs That Are Not PCGs
نویسندگان
چکیده
Let T be an edge weighted tree and let dmin, dmax be two nonnegative real numbers. Then the pairwise compatibility graph (PCG) of T is a graph G such that each vertex of G corresponds to a distinct leaf of T and two vertices are adjacent inG if and only if the weighted distance between their corresponding leaves in T is in the interval [dmin, dmax]. Similarly, a given graph G is a PCG if there exist suitable T, dmin, dmax, such that G is a PCG of T . Yanhaona, Bayzid and Rahman proved that there exists a graph with 15 vertices that is not a PCG. On the other hand, Calamoneri, Frascaria and Sinaimeri proved that every graph with at most seven vertices is a PCG. In this paper we construct a graph of eight vertices that is not a PCG, which strengthens the result of Yanhaona, Bayzid and Rahman, and implies optimality of the result of Calamoneri, Frascaria and Sinaimeri. We then construct a planar graph with sixteen vertices that is not a PCG. Finally, we prove a variant of the PCG recognition problem to be NP-complete.
منابع مشابه
Triangle-Free Outerplanar 3-Graphs Are Pairwise Compatibility Graphs
A graph G = (V,E) is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax such that each vertex u ′ ∈ V corresponds to a leaf u of T and there is an edge (u′, v′) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax in T . Here, dT (u, v) denotes the distance between u and v in T , which is the sum of the weights of the edges ...
متن کاملTwo lower bounds on
The lower bounds on communication complexity measures of language generation by Parallel Communicating Grammar Systems (PCGS) are investigated. The rst result shows that there exists a language that can be generated by some dag-PCGS (PCGS with communication structures realizable by directed acyclic graphs) consisting of 3 grammars, but by no PCGS with tree communication structure. The second re...
متن کاملNot All Graphs are Pairwise Compatibility Graphs
Given an edge weighted tree T and two non-negative real numbers dmin and dmax, a pairwise compatibility graph of T for dmin and dmax is a graph G = (V, E), where each vertex u ∈ V corresponds to a leaf u of T and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax in T . Here, dT (u, v) denotes the distance between u and v in T , which is the sum of the weights of the edges on th...
متن کاملSome classes of graphs that are not PCGs
A graph G = (V, E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax, dmin ≤ dmax, such that each node u ∈ V is uniquely associated to a leaf of T and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax, where dT (u, v) is the sum of the weights of the edges on the unique path PT (u, v) from u to v in T...
متن کاملOn Dilworth k Graphs and Their Pairwise Compatibility
The Dilworth number of a graph is the size of the largest subset of its nodes in which the close neighborhood of no node contains the neighborhood of another one. In this paper we give a new characterization of Dilworth k graphs, for each value of k, exactly defining their structure. Moreover, we put these graphs in relation with pairwise compatibility graphs (PCGs), i.e. graphs on n nodes that...
متن کاملAll Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs
A graph G is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a vertex u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT,w(lu, lv) ≤ dmax where dT,w(lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this note, we show ...
متن کامل